Towards Ludics Programming: Interactive Proof Search
نویسنده
چکیده
Girard [10] introduced Ludics as an interactive theory aiming at overcoming the distinction between syntax and semantics in logic. In this paper, we investigate how ludics could serve as a foundation for logic programming, providing a mechanism for interactive proof search, that is proof search by interaction (or proof search by cut-elimination).
منابع مشابه
An Interactive Approach to Control in Proof Search: Preliminary Results
Logic programming, as well as functional programming, benefitted from a strong connection with logic and proof theory which allowed to provide formal tools to analyze programs through logical tools. However, this logical analysis fails when control operators are concerned. A informal way to understand this is that the role of those operators is mostly to prune the search space while the search ...
متن کاملInteractive Proof Search with Ludics: Short Abstract
Proof Theory and Computation. Recent developments in proof theory have led to major advances in the theory of programming languages. The modelling of computation using proofs impacted deeply the foundational studies of programming languages as well as many of their practical issues. Declarative programming languages have been related mainly in two ways to the mathematical theory of proofs: on t...
متن کاملIntroduction to linear logic and ludics, part II
This paper is the second part of an introduction to linear logic and ludics, both due to Girard. It is devoted to proof nets, in the limited, yet central, framework of multiplicative linear logic (section 1) and to ludics, which has been recently developped in an aim of further unveiling the fundamental interactive nature of computation and logic (sections 2, 3, 4, and 5). We hope to offer a fe...
متن کاملInductive and Functional Types in Ludics
Ludics is a logical framework in which types/formulas are modelled by sets of terms with the same computational behaviour. This paper investigates the representation of inductive data types and functional types in ludics. We study their structure following a game semantics approach. Inductive types are interpreted as least fixed points, and we prove an internal completeness result giving an exp...
متن کاملSymmetry and interactivity in Programming
We recall some of the early occurrences of the notions of interac-tivity and symmetry in the operational and denotational semantics of programming languages. We suggest some connections with ludics. Proof theory and programming are deeply intertwinned research areas. This short paper will address and compare ideas from both sides, so it seems appropriate to begin by recalling what this general ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008